Attribute Reduction Based on the Rough Set Theory

نویسنده

  • Dong-yi ye
چکیده

36 www.ijeas.org  Abstract—The genetic algorithm is used to optimize the algorithm of attribute reduction in data preprocessing, and the rough approximation precision in the rough set theory is utilized to determine the importance of information attribute. From which the decision table is constituted by selecting the attributes which have higher degree of attribute importance, and the attribute core of decision information is obtained by using the identification matrix. The initial population is constructed on the standard of the attribute core , the search area of genetic algorithm is reduced. Finally, the correction operator based on the rough approximation precision is introduced, and the algorithm is made to conduct in the correct solution space, thus the speed of attribute reduction is improved, furthermore, the optimal results of attribute reduction are obtained.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Approach for Knowledge Based Systems Reduction using Rough Sets Theory (RESEARCH NOTE)

Problem of knowledge analysis for decision support system is the most difficult task of information systems. This paper presents a new approach based on notions of mathematical theory of Rough Sets to solve this problem. Using these concepts a systematic approach has been developed to reduce the size of decision database and extract reduced rules set from vague and uncertain data. The method ha...

متن کامل

T-Rough Sets Based on the Lattices

The aim of this paper is to introduce and study set- valued homomorphism on lattices and T-rough lattice with respect to a sublattice. This paper deals with T-rough set approach on the lattice theory. The result of this study contributes to, T-rough fuzzy set and approximation theory and proved in several papers. Keywords: approximation space; lattice; prime ideal; rough ideal; T-rough set; set...

متن کامل

An Improved Heuristic Attribute Reduction Algorithm Based on Informa- tion Entropy in Rough Set

At present, in rough set theory there are two kinds of heuristic attribute reduction algorithms, one is based on discernibility matrix, the other is based on mutual information. But if these algorithms are applied to the non-core information system, there will be much problems, such as too much calculation, excessive reduction, or insufficient reduction. So we propose an improved heuristic attr...

متن کامل

Ant Colony Optimization based Feature Selection in Rough Set Theory

Feature selection is an important concept in rough set theory; it aims to determine a minimal subset of features that are jointly sufficient for preserving a particular property of the original data. This paper proposes an attribute reduction method that is based on Ant Colony Optimization algorithm and rough set theory as an evaluation measurement. The proposed method was tested on standard be...

متن کامل

Reduction method for concept lattices based on rough set theory and its application

Rough set theory and formal concept analysis are two complementary mathematical tools for data analysis. In this paper, we study the reduction of the concept lattices based on rough set theory and propose two kinds of reduction methods for the above concept lattices. First, we present the sufficient and necessary conditions for justifying whether an attribute and an object are dispensable or in...

متن کامل

Attribute Reduction Based on Approximation Set of Rough Set ⋆

Attribute reduction is one of the core issues of the rough set theory. The traditional method of attribute reduction was designed based on positive region unchanged, as abandoning processing the incompatible data in the boundary domain, so the classification characteristics of the reduction results are not necessarily best. In this paper, the concept of relative approximate degree is proposed i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016